package com.cy.letcode.binary.findmid;

/**
 * 1 2 3 4 5
 * 0 3 4 6
 * <p>
 * 0 1 2 3 3 4 4 5 6
 * 9 4
 */
class Solution {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        int m = nums1.length;
        int n = nums2.length;
        int mid = (m + n) / 2;
        int l = 0, r = 0;
        while (l + r < mid) {
            if (nums1[l] > nums2[r]) {
                l++;
            }
        }

        return 0;
    }
}